Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach

Identifieur interne : 005C86 ( Main/Exploration ); précédent : 005C85; suivant : 005C87

Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach

Auteurs : Julien Fondrevelle ; Ammar Oulamara ; Marie-Claude Portmann

Source :

RBID : CRIN:fondrevelle05a

English descriptors

Abstract

In this article, we consider flowshop scheduling problems with time lags constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results and propose different approaches to solve the m-machine case.


Affiliations:

Links toward previous steps (curation, corpus...)

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="756">Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:fondrevelle05a</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004020</idno>
<idno type="wicri:Area/Crin/Curation">004020</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004020</idno>
<idno type="wicri:Area/Crin/Checkpoint">000134</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000134</idno>
<idno type="wicri:Area/Main/Merge">005F09</idno>
<idno type="wicri:Area/Main/Curation">005C86</idno>
<idno type="wicri:Area/Main/Exploration">005C86</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach</title>
<author>
<name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name>
</author>
<author>
<name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
</author>
<author>
<name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>branch and bound</term>
<term>complexity</term>
<term>flowshop</term>
<term>idle-time</term>
<term>minimal and maximal time lags</term>
<term>weighted sum of machine completion times</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="1035">In this article, we consider flowshop scheduling problems with time lags constraints to minimize the weighted sum of machine completion times as objective function. Although this criterion has been addressed in few papers, it may be extremely important in practical situations. We present several complexity results and propose different approaches to solve the m-machine case.</div>
</front>
</TEI>
<affiliations>
<list></list>
<tree>
<noCountry>
<name sortKey="Fondrevelle, Julien" sort="Fondrevelle, Julien" uniqKey="Fondrevelle J" first="Julien" last="Fondrevelle">Julien Fondrevelle</name>
<name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
<name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name>
</noCountry>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005C86 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005C86 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     CRIN:fondrevelle05a
   |texte=   Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022